#include <iostream>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <set>
#include <vector>
#include <cstdio>
#include <cmath>
#define LL long long
#define nextLine() {int c = 0; while ((c = getchar()) != EOF && c != 10);}
#define sqr(a) ((a) * (a))
#define fill(a, c) memset(a, c, sizeof a)
#define ldb long double
#define sgn(a) ((a) > eps ? 1 : -1)
const ldb eps = 1e-9;
const ldb pi = fabs(atan2(0.0, -1.0));
const int INF = 1 << 28;
const LL LINF = 1ll << 50;
const ldb LDINF = 1e70;
const ldb cos3 = cos(pi / 3);
const ldb sin3 = sin(pi / 3);
using namespace std;

int n;
LL k;
LL a[100010];
LL s[100019];
vector <pair<LL, int> > b;

void Load()
{
	cin >> n >> k;
	int i;
	for (i = 0; i < n; i++)
	{
		scanf("%I64d", &a[i]);
		b.push_back(make_pair(a[i], i));
	}
	sort(b.begin(), b.end());
}

void Out(LL k, int rem, LL minus)
{
	cerr << k << " " << rem << "\n";
	if (rem == 0) return;
	int i;
	minus += k / rem;
	for (i = 0; i < n; i++)
		a[i] = max(a[i] - minus, 0ll);
	
	LL from = k % (LL)rem;
/*	for (int i = 0; i < n; i++)
		cerr << a[i] << " ";
	cerr << "\n";
*/
	int j = -1;
	for (i = 0; j < from && i < n; i++)
	{
		if (a[i]) 
		{
			a[i]--;
			j++;
		}
	}
	i--;
	a[i]++;
	for (int i = 0; i < n; i++)
		cerr << a[i] << " ";
	cerr << "\n";



	rem = 0;
	for (j = 0; j < n; j++)
	{
		if (a[j]) rem++;
	}

	for (int k = 0; k < rem; k++)
	{
		cout << (i + 1) << " ";
		i = (i + 1) % n;
		while (a[i] == 0) i = (i + 1) % n; 
	}
}

void Solve()
{
	int minus = 0;
	LL cnt = 0;
	int i;
	for (i = 0; cnt < k && i < n;)
	{
//		cerr << cnt << " " << minus << " " << i << "\n";
		while (i < b.size() && b[i].first - minus == 0ll)
			i++;
//		cerr << cnt << " " << minus << " " << i << "\n";
		if (i == b.size())
		{
			cout << "-1";
			return;
		}
//		cerr << cnt << " " << minus << " " << (n - i) * (b[i].first - minus) << "\n";
		if (cnt + ((LL)n - i) * (b[i].first - minus) <= k)
		{
			cnt += (n - i) * (b[i].first - minus);
			minus += b[i].first - minus;
			continue;
		}
		else
		{
			Out(k - cnt, n - i, minus);
			return;
		}
	}
	while (i < b.size() && b[i].first - minus == 0ll)
			i++;
//	cerr << "asd " << minus << " " << i << "\n";
	Out(k - cnt, n - i, minus);
}

#define file "b"

int main()
{
	#ifndef ONLINE_JUDGE
	freopen(file".in", "rt", stdin);
	freopen(file".out", "wt", stdout);
	#endif
	Load();
	Solve();
	return 0;
}